Qualitative constraint satisfaction problems: An extended framework with landmarks
نویسندگان
چکیده
Dealing with spatial and temporal knowledge is an indispensable part of almost all aspects of human activity. The qualitative approach to spatial and temporal reasoning, known as Qualitative Spatial and Temporal Reasoning (QSTR), typically represents spatial/temporal knowledge in terms of qualitative relations (e.g., to the east of, after), and reasons with spatial/temporal knowledge by solving qualitative
منابع مشابه
Solving Qualitative Constraints Involving Landmarks
Consistency checking plays a central role in qualitative spatial and temporal reasoning. Given a set of variables V , and a set of constraints Γ taken from a qualitative calculus (e.g. the Interval Algebra (IA) or RCC-8), the aim is to decide if Γ is consistent. The consistency problem has been investigated extensively in the literature. Practical applications e.g. urban planning often impose, ...
متن کاملConstraint Logic Programming - a Framework for Qualitative Reasoning
We propose to use Constraint Logic Programming (CLP) for the specification and implementation of Qualitative Reasoning (QR) problems that are specialized Constraint Satisfaction Problems . The use of CLP has two advantages : (i) CLP gives a well defined and understood logical framework for the problem specification, and (ii) CLP is not only a logical framework, it is also a family oflanguages s...
متن کاملQualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems (CSPs) are characterized using a finite set of constraints expressed within a common, shared constraint language. When reasoning across time, however, it is possible to express both temporal and state-based constraints represented within multiple constraint languages. Qualitative simulation provides an instance of this class of CSP in which, tradi...
متن کاملConstraint Satisfaction Problems on Intervals and Lengths ∗
We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as Interval Graph Recognition and Interval Satisfiability can be considered as examples of such CSPs. One interesting question concerning such problems is ...
متن کاملLocal consistency for extended CSPs
We extend the framework of Constraint Satisfaction Problems to make it more suitable for/applicable to modern constraint programming languages where both constraint satisfaction and constraint solving have a role. Some rough principles for local consistency conditions in the extended framework are developed, appropriate notions of local consistency are formulated, and relationships between the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 201 شماره
صفحات -
تاریخ انتشار 2013